Decomposition of Multi-Output Boolean Functions∗
نویسندگان
چکیده
In this paper the problem of decomposition, mapping and minimization of multi-output boolean functions is discussed. First the mathematical formulation for single-output boolean functions is presented and then it is extended to multi-output functions. The proposed formulations use function decompositions, ETDDs (EXOR ternary decision diagrams) and multi-valued logic.
منابع مشابه
Eecient Robdd Based Computation of Common Decomposition Functions of Multi-output Boolean Functions
One of the crucial problems multi-level logic synthesis techniques for multi-output boolean functions f =
متن کاملBased FPGA Synthesis for Multi - Output Boolean Functions
| One of the crucial problems multi-level logic synthesis techniques for multi-output boolean functions f = (f 1 ; : : : ; f m ) : f0; 1g n ! f0; 1g m have to deal with is nding sublogic which can be shared by di erent outputs, i.e., nding boolean functions = ( 1 ; : : : ; h ) : f0; 1g p ! f0; 1g h which can be used as common sublogic of good realizations of f 1 ; : : : ; f m . In this paper we...
متن کاملOutput Grouping Method Based on a Similarity of Boolean Functions
A method allowing us to efficiently group the multi-output Boolean function outputs is presented in this paper. Some kind of decomposition is usually involved in the logic synthesis process. Here the circuit has to be repeatedly divided into subcircuits, until these subcircuits become technological library elements or technology-dependent components, in general. Our output-grouping method can b...
متن کاملBased FPGA Synthesis for Multi - Output
1 Communication Based FPGA Synthesis for Multi-Output Boolean Functions Christoph Scholl Paul Molitor Department of Computer Science Department of Computer Science Universit at des Saarlandes Martin-Luther Universit at Halle D 66041 Saarbr ucken, FRG D-06099 Halle (Saale), FRG Tel: ++49 681 302-2274 Tel: ++49 345 622 529 Fax: ++49 681 302-4421 Fax: ++49 345 622 514 e-mail: [email protected]...
متن کاملLogic Synthesis of LUT Cascades with Limited Rails
Programmable LUT cascades are used to evaluate multi-output Boolean functions. This paper shows several representations of multi-output functions and introduces a new decomposition algorithm applicable to these representations. The algorithm produces LUT cascades with the limited number of rails, which leads to significantly faster circuits and applicability to large designs. The experiment sho...
متن کامل